Affine variation formulas and affine minimal surfaces.
نویسندگان
چکیده
منابع مشابه
Discrete Affine Minimal Surfaces with Indefinite Metric
Inspired by the Weierstrass representation of smooth affine minimal surfaces with indefinite metric, we propose a constructive process producing a large class of discrete surfaces that we call discrete affine minimal surfaces. We show that they are critical points of an affine area functional defined on the space of quadrangular discrete surfaces. The construction makes use of asymptotic coordi...
متن کاملCauchy Problems for Discrete Affine Minimal Surfaces
In this paper we discuss planar quadrilateral (PQ) nets as discrete models for convex affine surfaces. As a main result, we prove a necessary and sufficient condition for a PQ net to admit a Lelieuvre co-normal vector field. Particular attention is given to the class of surfaces with discrete harmonic co-normals, which we call discrete affine minimal surfaces, and the subclass of surfaces with ...
متن کاملSmooth surfaces from bilinear patches: Discrete affine minimal surfaces☆
Motivated by applications in freeform architecture, we study surfaces which are composed of smoothly joined bilinear patches. These surfaces turn out to be discrete versions of negatively curved affine minimal surfaces and share many properties with their classical smooth counterparts. We present computational design approaches and study special cases which should be interesting for the archite...
متن کاملAffine like Surfaces
If X is a variety, then X is affine if and only if H(X,F) = 0 for all coherent sheaves F and for all positive i. This paper deals with the following natural question: Question: Classify all smooth varieties X (over C) with H(X,ΩjX) = 0 for all j and for all positive i. Of course if dimX = 1 such an X is affine. Here we deal with the case of surfaces and completely classify them. This question w...
متن کاملApproximating Propositional Knowledge with Affine Formulas
We consider the use of affine formulas, i.e., conjonctions of linear equations modulo , for approximating propositional knowledge. These formulas are very close to CNF formulas, and allow for efficient reasoning ; moreover, they can be minimized efficiently. We show that this class of formulas is identifiable and PAClearnable from examples, that an affine least upper bound of a relation can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1989
ISSN: 0026-2285
DOI: 10.1307/mmj/1029003883